This demonstration shows how a (n x n) size
chess board can be populated with n queens
under the condition that none can take any other.

Be careful with sizes > 20!
Computation time: